Lang-n-Send Extended: Sending Regular Expressions to Monitors

نویسندگان

چکیده

In prior work, Cimini has presented Lang-n-Send, a pi-calculus with language definitions. this paper, we present an extension of calculus called Lang-n-Send+m. First, revise Lang-n-Send to work transition system specifications rather than its specifications. This revision allows the use negative premises in deduction rules. Next, extend monitors and ability sending receiving regular expressions, which then can be used context larger expressions monitor execution programs. We reduction semantics for Lang-n-Send+m, offer examples that demonstrate scenarios our captures.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Optimal Monitors for Extended Regular Expressions

Ordinary software engineers and programmers can easily understand regular patterns, as shown by the immense interest in and the success of scripting languages like Perl, based essentially on regular expression pattern matching. We believe that regular expressions provide an elegant and powerful specification language also for monitoring requirements, because an execution trace of a program is i...

متن کامل

On Extended Regular Expressions

In this paper we extend the work of Campeanu, Salomaa and Yu [1] on extended regular expressions featured in the Unix utility egrep and the popular scripting language Perl. We settle the open issue of closure under intersection and provide an improved pumping lemma that will show that a larger class of languages is not recognizable by extended regular expressions. We also investigate some quest...

متن کامل

Rewriting Extended Regular Expressions

We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotonic operations; the latter property is crucial for some applications. We give a new complete Horn equational axiomatiztion of the algebra and develop some termrewriting techniques for constructing logical inferences of v...

متن کامل

From Sequential Extended Regular Expressions to NFA with Symbolic Labels

Practical property specification languages such as the IEEE standard PSL use at their core Sequential Extended Regular Expressions (SERE). In order to enable the reuse of traditional verification techniques, it is necessary to translate SEREs into automata. SERE are regular expressions built over alphabets resulting from the state variables of the design under analysis. Thus, a traditional appr...

متن کامل

Nominal Regular Expressions for Languages over Infinite Alphabets. Extended Abstract

We propose regular expressions to abstractly model and study properties of resource-aware computations. Inspired by nominal techniques – as those popular in process calculi – we extend classical regular expressions with names (to model computational resources) and suitable operators (for allocation, deallocation, scoping of, and freshness conditions on resources). We discuss classes of such nom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic proceedings in theoretical computer science

سال: 2022

ISSN: ['2075-2180']

DOI: https://doi.org/10.4204/eptcs.365.5